#include <bits/stdc++.h>

#define in read()
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define vec vector<int>
#define y1 y_____hahahaha_____1

using namespace std;

typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;

int read(){int x = 0,sgn = 1;char ch = getchar();for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;for(;isdigit(ch);ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48); return x * sgn;}

const int N = 410;
const int mod = 1e9 + 7;

ll fac[N],ifac[N];
int n,m,c;

ll qp(ll x,int t){ll res = 1;for(;t;t >>= 1,x = x * x % mod) if(t & 1) res = res * x % mod; return res;}

ll C(int x,int y){return x < 0 || y < 0 || x < y ? 0 : fac[x] * ifac[y] % mod * ifac[x - y] % mod;}

ll F(int x){
	ll res = 0;
	for(int i = 1;i <= m;i++){
		res = (res + C(m,i) * ((m - i) & 1 ? mod - 1 : 1) % mod * qp(qp(x + 1,i) - 1,n)) % mod;
	}
	return res;
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in,c = in;ll ans = 0;
	for(int i = (fac[0] = 1);i <= 400;i++) fac[i] = fac[i - 1] * i % mod; ifac[400] = qp(fac[400],mod-2);
	for(int i = 399;i >= 0;i--) ifac[i] = ifac[i + 1] * (i + 1) % mod;
	for(int i = 0;i <= c;i++){
		ans = (ans + F(i) * ((c - i) & 1 ? mod - 1 : 1) % mod * C(c,i) % mod) % mod;
	}
	printf("%lld\n",ans);
	return 0;
}
